On the Logic of TLA+
Identifieur interne : 007842 ( Main/Exploration ); précédent : 007841; suivant : 007843On the Logic of TLA+
Auteurs : Stephan MerzSource :
- Computers and Informatics ; 2003.
English descriptors
- KwdEn :
Abstract
TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic \TLA{} and classical set-theory, it provides an expressive specification formalism and supports assertional verification.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003796
- to stream Crin, to step Curation: 003796
- to stream Crin, to step Checkpoint: 000D73
- to stream Main, to step Merge: 007C20
- to stream Main, to step Curation: 007842
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="138">On the Logic of TLA+</title></titleStmt><publicationStmt><idno type="RBID">CRIN:merz03b</idno><date when="2003" year="2003">2003</date><idno type="wicri:Area/Crin/Corpus">003796</idno><idno type="wicri:Area/Crin/Curation">003796</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003796</idno><idno type="wicri:Area/Crin/Checkpoint">000D73</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000D73</idno><idno type="wicri:Area/Main/Merge">007C20</idno><idno type="wicri:Area/Main/Curation">007842</idno><idno type="wicri:Area/Main/Exploration">007842</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">On the Logic of TLA+</title><author><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name></author></analytic><series><title level="j">Computers and Informatics</title><imprint><date when="2003" type="published">2003</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>semantics</term><term>specification</term><term>temporal logic</term><term>tla</term><term>verification</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="966">TLA+ is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems. Combining the linear-time temporal logic \TLA{} and classical set-theory, it provides an expressive specification formalism and supports assertional verification.</div></front></TEI><affiliations><list></list><tree><noCountry><name sortKey="Merz, Stephan" sort="Merz, Stephan" uniqKey="Merz S" first="Stephan" last="Merz">Stephan Merz</name></noCountry></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007842 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007842 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= CRIN:merz03b
|texte= On the Logic of TLA+
}}
| This area was generated with Dilib version V0.6.33. |  |